√在线天堂中文最新版网,97se亚洲综合色区,国产成人av免费网址,国产成人av在线影院无毒,成人做爰100部片

×

minimum dominating set造句

例句與造句

  1. A minimum dominating set can be found in linear time in series-parallel graphs.
  2. There are graph families in which a minimum maximal independent set is a minimum dominating set.
  3. These include the minimum dominating set, minimum connected dominating set, and minimum total dominating set problems.
  4. It is also well known that the Minimum Dominating Set problem remains NP-complete for split graphs.
  5. There exists a pair of polynomial-time L-reductions between the minimum dominating set problem and the set cover problem.
  6. It's difficult to find minimum dominating set in a sentence. 用minimum dominating set造句挺難的
  7. In particular, an efficient ?-approximation algorithm for set covering provides an efficient ?-approximation algorithm for minimum dominating sets.
  8. Despite this domination perfectness property, it is NP-hard to determine the size of the minimum dominating set in a claw-free graph.
  9. A graph is called domination perfect if it has a minimum dominating set that is independent, and if the same property holds in all of its induced subgraphs.
  10. If the graph has maximum degree ?, then the greedy approximation algorithm finds an " O " ( log ? )-approximation of a minimum dominating set.
  11. This technique has given PTASs for the following problems : subgraph isomorphism, maximum independent set, minimum vertex cover, minimum dominating set, minimum edge dominating set, maximum triangle matching, and many others.
  12. The following pair of reductions shows that the minimum dominating set problem and the set cover problem are equivalent under L-reductions : given an instance of one problem, we can construct an equivalent instance of the other problem.
  13. A faster algorithm, using " O " ( 1.5048 " n " ) time was found by, who also show that the number of minimum dominating sets can be computed in this time.
  14. By repeating this replacement process one eventually reaches a dominating set no larger than " D ", so in particular when the starting set " D " is a minimum dominating set this process forms an equally small independent dominating set.
  15. However, many important and difficult graph optimization problems such as maximum independent set, graph coloring, and minimum dominating set can be approximated efficiently by using the geometric structure of these graphs, and the maximum clique problem can be solved exactly for these graphs in polynomial time, given a disk representation.
  16. The minimum dominating set in a graph will not necessarily be independent, but the size of a minimum dominating set is always less than or equal to the size of a minimum maximal independent set, that is, ? ( " G " ) d " " i " ( " G " ).
  17. 更多例句:  下一頁

相鄰詞匯

  1. "minimum distance code"造句
  2. "minimum distance decoding"造句
  3. "minimum distance estimation"造句
  4. "minimum distance method"造句
  5. "minimum documentation"造句
  6. "minimum dosage"造句
  7. "minimum dose"造句
  8. "minimum down payment"造句
  9. "minimum drag"造句
  10. "minimum drinking age"造句
桌面版繁體版English日本語

Copyright ? 2025 WordTech Co.